Hierarchical Scheduling Mechanisms in Multi-Level Fog Computing

Delivering cloud-like computing facilities at the network edge provides services with ultra-low-latency access, yielding highly responsive to application requests. The concept of fog has emerged as a paradigm that adds layers nodes between and cloud, also known micro data centers , xmlns:xlink="http://www.w3.org/1999/xlink">cloudlets or xmlns:xlink="http://www.w3.org/1999/xlink">fog nodes . Based on this premise, article proposes component-based service scheduler in cloud-fog infrastructure comprising several cloud. proposed aims satisfy application’s latency requirements by deciding which components should be moved upwards fog-cloud hierarchy alleviate workloads edge. One communication-aware policy is introduced for resource allocation enforce access prioritization among applications. We evaluate proposal using well-known iFogSim simulator. Results suggest scheduling algorithm can reduce average delays stricter while still reducing total usage when applications exchange components. have shown our was able to, average, overload impact approximately 11 percent compared best literature maintaining acceptable latency-sensitive